Factor Graph Decoding for Speech Presence Probability Estimation
نویسندگان
چکیده
This paper is concerned with speech presence probability estimation employing an explicit model of the temporal and spectral correlations of speech. An undirected graphical model is introduced, based on a Factor Graph formulation. It is shown that this undirected model cures some of the theoretical issues of an earlier directed graphical model. Furthermore, we formulate a message passing inference scheme based on an approximate graph factorization, identify this inference scheme as a particular message passing schedule based on the turbo principle and suggest further alternative schedules. The experiments show an improved performance over speech presence probability estimation based on an IID assumption, and a slightly better performance of the turbo schedule over the alternatives.
منابع مشابه
Continuous speech recognition in the WAXHOLM dialogue system
This paper presents the status of the continuous speech recognition engine of the WAXHOLM project. The engine is a software only system written in portable C code. The design is flexible and different modes for phonetic pattern matching are available. In particular, artificial neural networks and standard multiple Gaussian mixtures are implemented for phone probability estimation, and for resea...
متن کاملImproved speech recognition using iterative decoding based on confidence measures
In this paper, a decoding method incorporating word-level conndence measures for improved speech recognition is presented. At rst, we focus on the estimation of conndence measures from the word graph and evaluate them in word graph rescoring (2nd-pass in 2-pass search system). Next, we propose the lexical tree search (1st-pass in 2-pass search system) incorporating the word-level conndence meas...
متن کاملChannel Estimation in Block Fading Channels Using the Factor Graph EM Algorithm
Factor graphs, and message-passing over these graphs using the Sum-Product Algorithm (SPA), are an important method for unifying the tasks of channel estimation and decoding. In this paper, we use a variant of the Expectation-Maximization (EM) Algorithm that is formulated as a modification to the sum-product algorithm (SPA) over factor graphs. We firstly advance the theory of this factor graph ...
متن کاملImproved A Posteriori Speech Presence Probability Estimation Based on a Likelihood Ratio With Fixed Priors
In this contribution we present an improved estimator for the speech presence probability at each time-frequency point in the short-time Fourier-transform domain. In contrast to existing approaches this estimator does not rely on an adaptively estimated and thus signal dependent a priori signal-to-noise ratio estimate. It therefore decouples the estimation of the speech presence probability fro...
متن کاملAn Introduction to factor graphs - Signal Processing Magazine, IEEE
and artificial intelligence may be viewed as instances of the summary-product algorithm (or belief/probability propagation algorithm), which operates by message passing in a graphical model. Specific instances of such algorithms include Kalman filtering and smoothing; the forward–backward algorithm for hidden Markov models; probability propagation in Bayesian networks; and decoding algorithms f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016